The Generative Power of Probabilistic and Weighted Context-Free Grammars
نویسنده
چکیده
Over the last decade, probabilistic parsing has become the standard in the parsing literature where one of the purposes of those probabilities is to discard unlikely parses. We investigate the effect that discarding low probability parses has on both the weak and strong generative power of context-free grammars. We prove that probabilistic context-free grammars are more powerful than their non-probabilistic counterparts but in a way that is orthogonal to the Chomsky hierarchy. In particular, we show that the increase in power cannot be used to model any dependencies that discrete context-free grammars cannot.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملOn the Weak Generative Capacity of Weighted Context-free Grammars
It is shown how weighted context-free grammars can be used to recognize languages beyond their weak generative capacity by a one-step constant time extension of standard recognition algorithms.
متن کاملA Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called contextfree semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting an...
متن کاملSome Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars
Collage grammars and context-free chain-code grammars are compared with respect to their generative power. It is shown that the generated classes of line-drawing languages are incomparable, but that chain-code grammars can simulate collage grammars that use only similarity transformations.
متن کاملEmpirical Risk Minimization with Approximations of Probabilistic Grammars
When approximating a family of probabilistic grammars, it is convenient to assume the degree of the grammar is limited. We limit the degree of the grammar by making the assumption that Nk ≤ 2. This assumption may seem, at first glance, somewhat restrictive, but we show next that for probabilistic context-free grammars (and as a consequence, other formalisms), this assumption does not restrict g...
متن کامل